skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Search for: All records

Creators/Authors contains: "Pileggi, Larry"

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. null (Ed.)
  2. null (Ed.)
  3. null (Ed.)
    Traditional state estimation (SE) methods that are based on nonlinear minimization of the sum of localized measurement error functionals are known to suffer from nonconvergence and large residual errors. In this paper we propose an equivalent circuit formulation (ECF)-based SE approach that inherently considers the complete network topology and associated physical constraints. We analyze the mathematical differences between the two approaches and show that our approach produces a linear state-estimator that is mathematically a quadratic programming (QP) problem with closed-form solution. Furthermore, this formulation imposes additional topology-based constraints that provably shrink the feasible region and promote convergence to a more physically meaningful solution. From a probabilistic viewpoint, we show that our method applies prior knowledge into the estimate, thus converging to a more physics-based estimate than the traditional observation-driven maximum likelihood estimator (MLE). Importantly, incorporation of the entire system topology and underlying physics, while being linear, makes ECF-based SE advantageous for large-scale systems. 
    more » « less
  4. null (Ed.)